Variable Neighborhood Search for Attribute Reduction in Rough Set Theory
نویسنده
چکیده
Attribute reduction is a combinational optimization problem in data mining domain that aims to find a minimal subset from a large set of attributes. The typical high dimensionality of datasets precludes the use of greedy methods to find reducts because of its poor adaptability, and requires the use of stochastic methods. Variable Neighborhood Search (VNS) is a recent metaheuristic and have been successfully applied to solve combinational and global optimization problems. In our paper, the Variable Neighborhood Search scheme combined with a local search scheme called Variable Neighborhood Descent (VND) is adopted to find the reduction. We also use conditional entropy as metric to measure the quality of reduction. To verify the efficiency of our method, experiments are carried out on some standard UCI datasets. The results demonstrate the efficiency of our method.
منابع مشابه
An Innovative Approach for Attribute Reduction in Rough Set Theory
The Rough Sets Theory is used in data mining with emphasis on the treatment of uncertain or vague information. In the case of classification, this theory implicitly calculates reducts of the full set of attributes, eliminating those that are redundant or meaningless. Such reducts may even serve as input to other classifiers other than Rough Sets. The typical high dimensionality of current datab...
متن کاملSpectral Clustering with Neighborhood Attribute Reduction Based on Information Entropy
Traditional rough set theory is only suitable for dealing with discrete variables and need data preprocessing. Neighborhood rough sets overcome these shortcomings with the ability to directly process numeric data. This paper modifies the attribute reduction method based on neighborhood rough sets, in which the attribute importance is combined with information entropy to select the appropriate a...
متن کاملHeterogeneous Attribute Reduction in Noisy System based on a Generalized Neighborhood Rough Sets Model
Neighborhood Rough Sets (NRS) has been proven to be an efficient tool for heterogeneous attribute reduction. However, most of researches are focused on dealing with complete and noiseless data. Factually, most of the information systems are noisy, namely, filled with incomplete data and inconsistent data. In this paper, we introduce a generalized neighborhood rough sets model, called VPTNRS, to...
متن کاملGreat Deluge Algorithm for Rough Set Attribute Reduction
The process of reducing the number of attributes from an information system is known as attribute reduction problem. The action of attribute reduction problem is an important step of pre-processing in data mining. In the attribute reduction process, reduction is performed with considerations for minimum information loss. Having a dataset with discrete attribute values, it is possible to find a ...
متن کاملReduction of Neighborhood-Based Generalized Rough Sets
Rough set theory is a powerful tool for dealing with uncertainty, granularity, and incompleteness of knowledge in information systems. This paper discusses five types of existing neighborhoodbased generalized rough sets. The concepts of minimal neighborhood description and maximal neighborhood description of an element are defined, and by means of the two concepts, the properties and structures...
متن کامل